Traveling in Randomly Embedded Random Graphs
نویسندگان
چکیده
We consider the problem of traveling among random points in Euclidean space, when only a random fraction of the pairs are joined by traversable connections. In particular, we show a threshold for a pair of points to be connected by a geodesic of length arbitrarily close to their Euclidean distance, and analyze the minimum length Traveling Salesperson Tour, extending the BeardwoodHalton-Hammersley theorem to this setting.
منابع مشابه
Connectivity of Soft Random Geometric Graphs Over Annuli
Nodes are randomly distributed within an annulus (and then a shell) to form a point pattern of communication terminals which are linked stochastically according to the Rayleigh fading of radio-frequency data signals. We then present analytic formulas for the connection probability of these spatially embedded graphs, describing the connectivity behaviour as a dense-network limit is approached. T...
متن کاملContinuum Cascade Model of Directed Random Graphs: Traveling Wave Analysis
We study a class of directed random graphs. In these graphs, the interval [0, x] is the vertex set, and from each y ∈ [0, x], directed links are drawn to points in the interval (y, x] which are chosen uniformly with density one. We analyze the length of the longest directed path starting from the origin. In the x → ∞ limit, we employ traveling wave techniques to extract the asymptotic behavior ...
متن کاملRandom gravitational emulation search algorithm (RGES (in scheduling traveling salesman problem
this article proposes a new algorithm for finding a good approximate set of non-dominated solutions for solving generalized traveling salesman problem. Random gravitational emulation search algorithm (RGES (is presented for solving traveling salesman problem. The algorithm based on random search concepts, and uses two parameters, speed and force of gravity in physics. The proposed algorithm is ...
متن کاملCombining Simulated Annealing with Local Search Heuristics
We introduce a meta-heuristic to combine simulated annealing with local search methods for CO problems. This new class of Markov chains leads to signiicantly more powerful optimization methods than either simulated annealing or local search. The main idea is to embed deterministic local search techniques into simulated annealing so that the chain explores only local optima. It makes large, glob...
متن کاملOn the Stretch Factor of Randomly Embedded Random Graphs
We consider a random graph G(n, p) whose vertex set V has been randomly embedded in the unit square and whose edges are given weight equal to the geometric distance between their end vertices. Then each pair {u, v} of vertices have a distance in the weighted graph, and a Euclidean distance. The stretch factor of the embedded graph is defined as the maximum ratio of these two distances, over all...
متن کامل